Clifford semigroups and monotonicity

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterizing Compact Clifford Semigroups That Embed into Convolution and Functor-semigroups

We study algebraic and topological properties of the convolution semigroups of probability measures on topological groups and show that a compact Clifford topological semigroup S embeds into the convolution semigroup P (G) over some topological group G if and only if S embeds into the semigroup exp(G) of compact subsets of G if and only if S is an inverse semigroup and has zero-dimensional maxi...

متن کامل

Clifford Wavelets and Clifford-valued MRAs

In this paper using the Clifford algebra over R4 and its matrix representation, we construct Clifford scaling functions and Clifford wavelets. Then we compute related mask functions and filters, which arise in many applications such as quantum mechanics.

متن کامل

compactifications and representations of transformation semigroups

this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...

15 صفحه اول

Semi-Clifford and Generalized Semi-Clifford Operations

Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and Clifford operators can be applied fault-tolerantly. Indeed, this technique can be generalized for an extended set of gates, the so called Ck hierarchy gates, intro...

متن کامل

Stochastic Monotonicity and Realizable Monotonicity

We explore and relate two notions of monotonicity, stochastic and realizable, for a system of probability measures on a common finite partially ordered set (poset) S when the measures are indexed by another poset A. We give counterexamples to show that the two notions are not always equivalent, but for various large classes of S we also present conditions on the poset A that are necessary and s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1985

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700009746